翻訳と辞書 Words near each other ・ Set the World on Fire ・ Set the World on Fire (Annihilator album) ・ Set the World on Fire (Annihilator song) ・ Set the World on Fire (Black Veil Brides album) ・ Set the World on Fire (E-Type song) ・ Set the World on Fire Tour ・ Set Them Free ・ Set theoretic programming ・ Set theory ・ Set theory (music) ・ Set theory of the real line ・ Set This Circus Down ・ Set This House on Fire ・ Set to Music ・ Set tool ・ Set TSP problem ・ Set U Free ・ Set U Free (Planet Soul song) ・ Set Up (2005 film) ・ Set Us Free ・ Set Weights ・ SET XV ・ Set You Free ・ Set You Free (Gary Allan album) ・ Set You Free (N-Trance song) ・ Set You Free (The Black Keys song) ・ Set You Free This Time ・ Set Your Body Free ・ Set Your Goals ・ Set Your Goals (album) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Set TSP problem ： ウィキペディア英語版 Set TSP problem In combinatorial optimization, the set TSP, also known as the, generalized TSP, group TSP, One-of-a-Set TSP, Multiple Choice TSP or Covering Salesman Problem, is a generalization of the Traveling salesman problem (TSP), whereby it is required to find a shortest tour in a graph which visits all specified disjoint subsets of the vertices of a graph. The ordinary TSP is a special case of the set TSP when all subsets to be visited are singletons. Therefore the set TSP is also NP-hard. There is a direct reduction from set TSP to asymmetric TSP, and thus from set TSP to TSP. The idea is to arbitrarily assign a directed cycle to each set. The salesman, when visiting a vertex in some set, then walks around the cycle for free. To not use the cycle would ultimately be very costly. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Set TSP problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.